The eigenpairs of a Sylvester-Kac type matrix associated with a simple model for one-dimensional deposition and evaporation
نویسندگان
چکیده
This random sequential model is quite general and versatile, and can be customized to describe a variety of two-state physical systems that exhibit adsorption and evaporation processes. One-dimensional sequential adsorption models have been studied thoroughly in different physics contexts [17, 34]. Adsorption in two dimensions is not as well understood, however. There are quite a few computational papers [17] on the topic, but few analytical solutions exist for the general two-dimensional case. The adsorption of particles is exactly solvable in higher dimensions only for tree-like lattices. Recently, analytical results have been reported for the random sequential process [8] and reaction-diffusion processes on Cayley trees and Bethe lattices [2, 19, 29]. The standard method used to study these systems is the empty-interval method [27]. This mathematical method fails when evaporation is considered. We here demonstrate that a matrix theory approach can lead to exact results for a variety of physical systems. Two specific experimental topics motivate our paper. One is the self-assembly mechanism of charged nanoparticles on a glass substrate [24]. Known in literature as ionic self-assembled monolayers (ISAM), this technique has been used successfully in making antireflective coatings [14, 40]. Physical properties of these coatings depend upon the surface coverage of the substrate. The deposition process is stochastic, with particles attaching to and detaching from the substrate, so a random sequential adsorption model with evaporation is appropriate. The second motivating experimental setting involves properties of synthetic polymers called dendrimers, which have potential use as a drug delivery mechanism via drug encapsulation [26]. Dendrimers are physical analogs of Cayley tree structures. They are highly
منابع مشابه
On the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کاملThe two parameter quantum groups $U_{r,s}(mathfrak{g})$ associated to generalized Kac-Moody algebra and their equitable presentation
We construct a family of two parameter quantum grou-\ps $U_{r,s}(mathfrak{g})$ associated with a generalized Kac-Moody algebra corresponding to symmetrizable admissible Borcherds Cartan matrix. We also construct the $textbf{A}$-form $U_{textbf{A}}$ and the classical limit of $U_{r,s}(mathfrak{g})$. Furthermore, we display the equitable presentation for a subalgebra $U_{r...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملTopological Relationship Between One-Dimensional Box Model and Randić Indices in Linear Simple Conjugated Polyenes
The alternative double bonds and conjugation in the polyene compounds are one of the main properties in these compounds. Each carbon-carbon bonds in a polyene compound along the chain has appreciable double-bond character. The p-electrons are therefore not localized but are relatively free to move throughout the entire carbon skeleton as an one-dimensional box. The skeleton be considered as a r...
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 2013